A Survey on Perfectly Secure Verifiable Secret-sharing

Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing. It used as building block several computing tasks, such Byzantine agreement and multi-party computation. In this article, we consider VSS schemes with perfect security, tolerating computationally unbounded adversaries. We comprehensively survey the existing perfectly three different communication settings, namely, synchronous, asynchronous, hybrid setting provide full details of these settings. The aim to clear knowledge foundation researchers who are interested knowing extending state-of-the-art schemes.